Application of complex codes to maximize user link utilization

ABSTRACT

A method of increasing utilization of user link bandwidth for a code division multiple access communications system is disclosed that includes the steps of selecting a set of orthogonal complex codes each having a code length that is greater than a code length of an optimum real code and less than or equal to a spreading code length; and transferring symbols across at least one of a plurality of user links to or from at least one of a corresponding plurality of user terminals wherein the symbols are represented by a corresponding one of the set of orthogonal complex codes.

BACKGROUND OF THE INVENTION

[0001] The present invention relates generally to code division multiple access (CDMA) cellular communications systems. More specifically, but without limitation thereto, the present invention relates to assigning variable length codes to service a maximum number of users in a code division multiple access service area that is assigned a fixed frequency band.

[0002] The radio frequency spectrum is limited almost everywhere in the world and is generally licensed in fixed frequency bands. Code division multiple access (CDMA) cellular communications systems typically use a set of CDMA codes that are orthogonal to one another to avoid mutual interference. The term orthogonal is applied to a set of codes if the vector dot product of any code in the set with any other code in the set results in zero. For example, the code (−1, −1) is orthogonal to the code (−1, 1) since −1*−1+−1*1=0. Currently known orthogonal CDMA codes have a code length of 2^(n), where n is a positive integer. The available frequency bands are not necessarily integrally divisible by 2^(n), however. For example, for a user link that has 5 MHz of available bandwidth, the coded bit rate is 144 kbps (kilobits per second). If quadrature phase shift keying (QPSK) modulation is used, then the maximum ratio of bandwidth to symbol rate, or spreading code length, would be 68. However, no orthogonal codes are available having a code length of 68. The closest power of two that is less than 68 is 64. About six percent of the available bandwidth is therefore unusable using conventional CDMA codes. In other cases, there may be a substantially higher percentage of unused bandwidth due to the limited code lengths available using conventional CDMA codes. The unused bandwidth represents a loss of revenue from potential CDMA subscribers that might otherwise be included in the same service area.

SUMMARY OF THE INVENTION

[0003] The present invention advantageously addresses the problems above as well as other problems by providing a method of increasing utilization of user link bandwidth for a code division multiple access communications system.

[0004] In one embodiment, the present invention may be characterized a method of increasing utilization of user link bandwidth for a code division multiple access communications system that includes the steps of selecting a set of orthogonal complex codes each having a code length that is greater than a code length of an optimum real code and less than or equal to a spreading code length; and transferring symbols across at least one of a plurality of user links to or from at least one of a corresponding plurality of user terminals wherein the symbols are represented by a corresponding one of the set of orthogonal complex codes.

[0005] In another embodiment, the present invention may be characterized as a code division multiple access communications system that includes a base station; a geo-stationary platform; a feeder link coupled to the base station and the geo-stationary platform for transferring symbols between the base station and the geo-stationary platform; a plurality of user terminals; and a plurality of user links coupled respectively to the plurality of user terminals and to the geo-stationary platform for transferring symbols between the geo-stationary platform and at least one of the plurality of user terminals wherein the symbols are represented by at a corresponding one of a set of orthogonal complex codes having a code length that is greater than a code length of an optimum real code and less than or equal to a spreading code length.

BRIEF DESCRIPTION OF THE DRAWINGS

[0006] The features and advantages of the present invention may be apprehended from the following description thereof, presented in conjunction with the following drawings wherein:

[0007]FIG. 1 is a diagram of a code division multiple access (CDMA) communications system of the prior art; and

[0008]FIG. 2 is an exemplary set of orthogonal complex codes for the maximizing the user link bandwidth of the code division multiple access communications system of FIG. 1 according to an embodiment of the present invention.

[0009] Corresponding reference characters indicate corresponding elements throughout the several views of the drawings.

DESCRIPTION OF THE EMBODIMENTS

[0010]FIG. 1 is a diagram of a typical code division multiple access (CDMA) communications system 100. Shown in FIG. 1 are a base station 102, a feeder link 104, a geo-stationary platform 106, user links 108, and user terminals 110.

[0011] The base station 102 transmits and receives symbols between user terminals 110 across the feeder link 104. The feeder link 104 is an RF communications link between the base station 102 and the geo-stationary platform 106. The geo-stationary platform 106 is typically a geo-stationary satellite, however other platforms having a relatively fixed position with respect to the base station 102 may also be used according to techniques well known in the art. Because the feeder link 104 is between only two points (point-to-point), code division multiple access communications between the base station 102 and the geo-stationary satellite 106 are generally synchronous, and may be modulated by, for example, quadrature phase shift keying (QPSK).

[0012] The user terminals 110, may be, for example, cellular telephones. The user links 108 are RF communications links between the respective user terminals 110 and the geo-stationary satellite 106. Because the user links 108 are between multiple points whose positions relative to the geo-stationary satellite 106 may change (point-to-multiple-point), communications between the user terminals 110 and the geo-stationary satellite 106 are generally asynchronous, and may be modulated, for example, by quadrature phase shift keying (QPSK).

[0013] To avoid mutual interference, code division multiple access (CDMA) communications systems generally use mutually orthogonal codes for transferring symbols across the user links 108. One example of mutually orthogonal codes is a set of Walsh codes. Walsh codes may be generated from Walsh code functions as follows. To generate a Walsh code sequence of code length two starting from a seed value of −1 for a Walsh code of code length one, the seed value of −1 is appended to itself to generate the first Walsh code, (−1,−1). The bit-inverse of the seed value is appended to the seed value to generate the second Walsh code, (−1,1). This is the equivalent of creating the 2-bit Walsh code table shown in Table 1 below. TABLE 1 Walsh Code W0 W1 0 −1 −1 1 −1  1

[0014] The procedure used to create Table 1 may be repeated to generate the Walsh codes for the next higher order, i.e., the next longer Walsh code length, as shown in Table 2 below. The 2×2 matrix in bit positions W0 and W1, also called the Hadamard transform matrix, is appended to itself in bit positions W2 and W3 to generate the first two Walsh codes 0 and 1. The second two Walsh codes 2 and 3 are generated by appending the bit-inverse of the 2×2 matrix to the original 2×2 matrix. TABLE 2 Walsh Code W0 W1 W2 W3 0 −1 −1 −1 −1 1 −1  1 −1  1 2 −1 −1  1  1 3 −1  1  1 −1

[0015] Additional Walsh code tables for the higher order Walsh code lengths may be generated by repeating the procedure above. For example, to create eight-bit Walsh codes, the 4×4 matrix of Table 2 is replicated three times and inverted in the lower right hand quadrant as shown in Table 3 below. TABLE 3 Walsh Code W0 W1 W2 W3 W4 W5 W6 W7 0 −1 −1 −1 −1 −1 −1 −1 −1 1 −1 1 −1 1 −1 1 −1 1 2 −1 −1 1 1 −1 −1 1 1 3 −1 1 1 −1 −1 1 1 −1 4 −1 −1 −1 −1 1 1 1 1 5 −1 1 −1 1 1 −1 1 −1 6 −1 −1 1 1 1 1 −1 −1 7 −1 1 1 −1 1 −1 −1 1

[0016] Each Walsh code has a code length of 2^(n) bits, where n is a power of 2. In quadrature phase shift keying modulation, a Walsh code is represented by modulating the RF carrier phase between −90 degrees for a −1 and +90 degrees for a 1. Because −90 degrees and +90 degrees lie on the real axis of a phase vector coordinate system, the corresponding codes are called real codes.

[0017] In a code division multiple access system wherein orthogonal codes are generated by Walsh functions, the user data rate may be variable. For example, for a set of orthogonal Walsh codes having a code length of eight and a basic data rate of R, a code division multiple access system can support the following scenarios:

[0018] (1) all eight users with a data rate of R,

[0019] (2) one user with a data rate of 2R and 4 users with a data rate of R,

[0020] (3) one user with a data rate of 4R and 2 users with a data rate of R, and

[0021] (4) one user with a data rate of 8R. In this case, the entire bandwidth is dedicated to a single user.

[0022] Other scenarios such as those described above may be used to show that the number of available data rates for a given code length is half the code length. In the example above, there are four data rates (R, 2R, 4R, and 8R).

[0023] By introducing additional phase values for modulating the phase of the RF carrier, a set of orthogonal complex codes to represent symbols transferred across the user links 108 may be selected. Each of the orthogonal complex codes has a selected code length other than 2^(n). for example, a selected orthogonal complex code may have a code length of 4n. Because there are more values of 4n in a given numerical interval than there are values of 2^(n), a set of orthogonal complex codes may be selected to utilize a greater portion of a fixed bandwidth than may be possible with the optimum set of real codes having a code length equal to the closest value of 2^(n) that does not exceed the spreading code length.

[0024] By way of example, a set of orthogonal complex codes of code length 4n to represent symbols transferred across the user links 108 may be generated from the following Kronecker tensor product:

C_(L×P)=A_(L)

W_(P)  (1)

[0025] wherein

[0026] C_(L×P) is a matrix of complex codes each having a code length equal to L×P,

[0027] L is a positive integer,

[0028] P equals 2^(n) and n equals a positive integer,

[0029] W_(P) is a Walsh code of code length P,

[0030] A_(L) is a coefficient matrix of elements a_(jk), where j=1 . . . L, k=1 . . . L, and

a_(jk)=e^(j2n(j−1)(k−1)/L)  (2)

[0031] The optimum Walsh code rate is the highest power of two that is less than or equal to the ratio of bandwidth to symbol rate, or spreading code length. For example, the optimum Walsh code length for a spreading code length of 12 is 2³, since the next higher Walsh code length of 2⁴ exceeds the spreading code length. Because orthogonal complex codes generated, for example, by formula (1) may have a code length of 4n, a set of orthogonal complex codes having a code length greater than the optimum Walsh code length may be generated to fully utilize a spreading code length of 12. For a spreading code length of 12, the following mixture of data rates is possible:

[0032] (1) all 12 users with a data rate of R,

[0033] (2) one user with a data rate of 3R and nine users with a data rate of R,

[0034] (3) one user with a data rate of 6R and six users with a data rate of R, and

[0035] (4) one user with a data rate of 12R. In this case, the entire bandwidth is dedicated to a single user.

[0036] By way of example, to generate a set of complex codes of code length 12 using formula (1), let L=3 and P=4. The complex CDMA code is then given by the following relation: $\begin{matrix} {C_{3 \times 4} = \begin{bmatrix} {a_{11}W_{4}} & {a_{12}W_{4}} & {a_{13}W_{4}} \\ {a_{21}W_{4}} & {a_{22}W_{4}} & {a_{23}W_{4}} \\ {a_{31}W_{4}} & {a_{32}W_{4}} & {a_{33}W_{4}} \end{bmatrix}} & (3) \end{matrix}$

[0037] Numerically, C_(3×4) equals the matrix of orthogonal complex codes illustrated in FIG. 2. Each column and corresponding row of the matrix of orthogonal complex codes illustrated in FIG. 2 is a complex code that is orthogonal to each of the other complex codes.

[0038] For the example of a given bandwidth of 5 MHz and a given bit rate of 144 kbps described above, the bandwidth utilization of the user link in the code division multiple access communication system 100 may be improved from 64/68=94 percent for the optimum set of real codes to 68/68=100 percent by implementing a set of orthogonal complex codes such as those generated in the example above as well as other sets of orthogonal complex codes that may be generated for specific applications. The increase in bandwidth utilization is generally available in those cases where a set of orthogonal complex codes may be generated having a code length that is greater than the optimum real code length and less than or equal to the corresponding spreading code length for a given user link bandwidth and a given data bit rate. The greater code length of the selected set of orthogonal complex codes allows more user terminals 110 to share the same service area, thereby reducing the number of service areas required and the corresponding total cost of support equipment. In cases where the ratio of the spectrum bandwidth to the symbol rate happens to be equal or very close to 2^(n), real codes are preferable to complex codes. At other ratios, however, complex codes may be used advantageously to increase the capacity of a code division multiple access communications system.

[0039] Other modifications, variations, and arrangements of the present invention may be made in accordance with the above teachings other than as specifically described to practice the invention within the spirit and scope of the following claims. 

What is claimed is:
 1. A method of increasing utilization of user link bandwidth for a code division multiple access communications system comprising the steps of: selecting a set of orthogonal complex codes each having a code length that is greater than a code length of an optimum real code and less than or equal to a spreading code length; and transferring symbols across at least one of a plurality of user links to or from at least one of a corresponding plurality of user terminals wherein the symbols are represented by a corresponding one of the set of orthogonal complex codes.
 2. The method of claim 1 wherein the set of orthogonal complex codes is generated from a Kronecker tensor product given by formula: C_(L×P)=A_(L)

W_(P) wherein C_(L×P) is a matrix of orthogonal complex codes wherein each of the orthogonal complex codes has a code length equal to L×P, L is a positive integer, P equals 2^(n) where n equals a positive integer, W_(P) is a Walsh code matrix for a code length of P, A_(L) is a matrix of coefficients ark wherein j is a row index equal to 1 . . . L, k is a column index equal to 1 . . . L, and a_(jk)=e^(j2n(j−1)(k−1)/L).
 3. The system of claim 1 wherein the corresponding one of the set of orthogonal complex codes has a code length of
 12. 4. The system of claim 1 wherein the spreading code has a code length of
 12. 5. A code division multiple access communications system comprising: a base station; a geo-stationary platform; a feeder link coupled to the base station and the geo-stationary platform for transferring symbols between the base station and the geo-stationary platform; a plurality of user terminals; and a plurality of user links coupled respectively to the plurality of user terminals and to the geo-stationary platform for transferring symbols between the geo-stationary platform and at least one of the plurality of user terminals wherein the symbols are represented by at a corresponding one of a set of orthogonal complex codes having a code length that is greater than a code length of an optimum real code and less than or equal to a spreading code length.
 6. The system of claim 5 wherein the set of orthogonal complex codes is generated from a Kronecker tensor product given by: C_(L×P)=A_(L)

W_(P) wherein C_(L×P) is a matrix of orthogonal complex codes wherein the at least one of the orthogonal complex codes has a code length equal to L×P, L is a positive integer, P equals 2^(n) and n equals a positive integer, W_(P) is a Walsh code matrix for a code length of P, A_(L) is a matrix of coefficients a_(jk), where j is a row index equal to 1 . . . L, k is a column index equal to 1 . . . L, and a_(jk)=e^(j2n(j−1)(k−1)/L).
 7. The system of claim 5 wherein the at least one of the set of orthogonal complex codes has a code length of
 12. 8. The system of claim 5 wherein the spreading code has a code length of
 12. 9. A method of increasing utilization of user link bandwidth in a code division multiple access communications system comprising the steps of: selecting a spreading code length; and selecting a set of orthogonal complex codes each having a code length that is greater than a code length of an optimum real code and less than or equal to the spreading code length.
 10. The method of claim 9 further comprising the step of transferring symbols across a user link to or from a user terminal wherein the symbols are represented by a corresponding one of the set of orthogonal complex codes. 